Quantum Bit Commitment from a Physical Assumption

نویسنده

  • Louis Salvail
چکیده

Mayers and independently Lo and Chau have shown that unconditionally secure quantum bit commitment is impossible. In this paper we show that under the assumption that the sender is not able to perform generalized measurements involving more than n qubits coherently (n-coherent measurements) then quantum bit commitment is possible. A commitment scheme is δ-binding if for each execution there is an x̃ ∈ {0, 1} that cannot be unveiled with probability of success better than δ. Our bit commitment scheme requires the transmission of N qubits and is δ-binding, for any δ > 0, if the committer can only carry out n-coherent measurements for some n ∈ Ω(N). For some α > 0, the scheme is 2−αN -binding against n-coherent measurements for some n ∈ Ω(√N). The security against malicious receivers is unconditional.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unconditionally Secure Quantum Bit Commitment

Lo and Chau, and independently Mayers, have shown that all quantum bit commitment schemes proposed to date are insecure: one or both participants can cheat if they have a quantum computer. They claim also to have demonstrated that unconditionally secure quantum bit commitment is impossible. However, their no-go arguments rely on models of quantum cryptographic protocols which are insufficiently...

متن کامل

A Non-Interactive Quantum Bit Commitment Scheme that Exploits the Computational Hardness of Quantum State Distinction

We propose an efficient quantum protocol performing quantum bit commitment, which is a simple cryptographic primitive involved with two parties, called a committer and a verifier. Our protocol is non-interactive, uses no supplemental shared information, and achieves computational concealing and statistical binding under a natural complexity-theoretical assumption. An earlier protocol in the lit...

متن کامل

A Paradox of Quantum Universal Composability

Security of cryptographic protocols under composition is a major concern in cryptography. For classical cryptography Canetti gave a definition of security implying universal composability [Can01]. A protocol proven secure in that sense may replace ideal functionalities in arbitrary applications preserving the overall security of the application. In this contribution we sketch the modifications ...

متن کامل

Experimental unconditionally secure bit commitment.

Quantum physics allows for unconditionally secure communication between parties that trust each other. However, when the parties do not trust each other such as in the bit commitment scenario, quantum physics is not enough to guarantee security unless extra assumptions are made. Unconditionally secure bit commitment only becomes feasible when quantum physics is combined with relativistic causal...

متن کامل

Classical and quantum strategies for bit commitment schemes in the two-prover model

We show that the long-standing assumption of “no-communication” between the provers of the two-prover model is not sufficiently precise to guarantee the security of a bit commitment scheme against malicious adversaries. Indeed, we show how a simple correlated random variable, which does not allow to communicate, can be used to cheat a simplified version (sBGKW) of the bit commitment scheme of B...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998